Indexing XML documents efficiently

ABSTRACT

Information hierarchies are efficiently stored and accessed in a relational or object-relational database system. A path signature, similar to a pathname, is stored in a database system in association with data for the node identified by the pathname. For example, a path signature identifying an element is stored in a row that holds data for the element. To retrieve data for a hierarchical query that identifies the data requested using, for example, an XPATH string, a string pattern is generated that is matched by path signatures identified by the XPATH string. Pattern matching is then used to select rows associated with matching path signatures, and data from the selected rows is used to compute the XPATH query. Furthermore, hash values representing path signatures are generated in a way that preserves the ordering of data in an information hierarchy. The hash values can be indexed to provide quick access.

RELATED APPLICATIONS

The present application claims priority to U.S. Provisional Application No. 60/500,568, entitled Storing and Indexing XML Natively in an Oracle RDBMS, filed by Sanjay M. Krishnamurthy on Sep. 4, 2003, the contents of which are incorporated herein by reference.

FIELD OF THE INVENTION

The present invention relates to storing and accessing data in a database, and in particular, efficiently accessing hierarchical data stored in a database system.

BACKGROUND OF THE INVENTION

The number of businesses exchanging information electronically is proliferating. Businesses that exchange information have recognized the need for a common standard for representing data. Extensible Markup Language (“XML”) is rapidly becoming such a common standard.

XML describes and provides structure to a body of data, such as a file or data packet. The XML standard provides for tags that delimit a body of data into sections referred to as XML elements. Each XML element may contain one or more name-value pairs referred to as attributes.

Referring to FIG. 1, it shows XML document 101, provided to illustrate XML and XML elements. XML elements are delimited by a start tag and a corresponding end tag. For example, XML document 101 contains the start tag <A> (corresponding to <A id=“0”> and the end tag </A> to delimit an element, and <D> and </D> to delimit another element. The data between the elements is referred to as the element's content.

An element is herein referred to by its start tag. For example, the element delimited by the start and end tags <A> and </A> is referred to as the A element.

Element content may contain various types of data, which may include attributes, other elements, and text data. Attributes of an element are represented by attribute name-value pairs. An attribute name-value pair specifies the attribute's name and value. For example, A contains the attribute name-value pair id=‘0’, specifying an attribute name of id and an attribute value of the string literal ‘0’.

The elements A and C contain one or more elements. Specifically, A contains elements C and D, and C contains element D. An element that is contained by another element is referred to as a descendant of that element. Thus, C and D are descendants of A.

An XML document, such as XML document 101, is an example of an information hierarchy. An information hierarchy is a body of data items that are hierarchically related. In an XML document, the hierarchically related data items include elements and element attributes. By defining an element that contains attributes and descendant elements, an XML document defines a hierarchical tree relationship between the element, its descendant elements, and its attribute.

Because an XML document is an information hierarchy, each element contained therein may be located by following a “path” through the hierarchy to the item. Within an XML document, the path to an element begins at the root of the tree and down the hierarchy of elements to eventually arrive at the element of interest. For example, the path to D consists of elements A and C, in that order.

A convenient way to identify and locate a specific item of information stored in an information hierarchy is through the use of a “pathname”. A pathname is a concise way of uniquely identifying an item based on the path through the hierarchy to the item. A pathname is composed of a sequence of names. In the context of an XML document, the names in a pathname are elements or element attributes. For example, ‘/A/C/D’ identifies element D.

XML Storage Mechanisms

Various types of hierarchical storage mechanisms are used to store XML documents. One type stores an XML document as a text file in a file system.

Other types of hierarchical storage mechanisms store the parts of an XML document in a relational or object-relational database system. For example, an entire XML document may be stored in a blob (binary large object), or the parts of an XML document may be stored in different rows in one or more relational tables, each row containing one or more parts of an XML document. An XML document may also be stored as a hierarchy of objects in an object-relational database; each object is an instance of an object class and stores one or more elements of an XML document. The object class defines, for example, the structure of an element, and includes references or pointers to objects representing the immediate descendants of the element.

Storing XML documents in a database system has many advantages. Database systems are well suited for storing large amounts of information. Queries may be used to retrieve data that matches complex search criteria. The data may be easily and efficiently retrieved from a relational database system. However, database systems are not configured to retrieve efficiently, if at all, data for queries that request data identified by the data's location within an information hierarchy.

One way for a query to identify the requested data's location within an information hierarchy is through the use of a string that conforms to the standard prescribed in the document XML Path Language (XPATH), version 1.0 (W3C Recommendation 16 Nov. 1999). The XPATH standard defines a syntax and semantic for addressing parts of a document. For example, the query “/A/B” requests the subtree descending from a descendant of A with the element name B. The query “/A/B/@id” requests the attribute id of a descendant of A with the element name B.

A query that requests data based on a position within a hierarchy is referred to herein as a hierarchical query. A hierarchical query that uses a string that conforms to XPATH to identify the location within a hierarchy of the requested data is referred to herein as an XPATH query. The process of retrieving the data requested by a hierarchical query is referred to herein as hierarchical retrieval.

One approach to hierarchical retrieval is to retrieve all the rows that store part of a XML document, construct an in-memory representation of the complete XML document, and then search and traverse the tree to get the requested data. XML documents can be quite large. The processing required to build an in-memory representation of a large XML document can be expensive and the amount of memory needed to store the in-memory representation can easily exceed available memory resources on a computer.

When all XML documents are stored as a set of objects in an object-relational database system, another approach can be used for hierarchical retrieval. The objects used to store the XML document can be traversed by following the references or pointers defining the hierarchical relationship between the objects. The advantage of this approach is that not all the objects used to represent an XML document need to be loaded into memory; only objects that are traversed need be loaded.

A disadvantage of this approach stems from the fact that object-relational database systems are limited in the number of object classes they can effectively handle. Representing an XML document with objects requires defining object classes for each type of element in the XML document. An object-relational database might have to be configured to define many object classes for many XML documents and store very many objects. Generally, an object-relational database system can efficiently and effectively handle only up to a threshold number of object types, a threshold that can be easily exceeded when using an object-relational database system to store XML documents.

Yet another approach is to store the data that defines each parent-child relationship in the hierarchy of a XML document, and use the data to determine which data to return for an XPATH query. For example, a table stores a XML document, each row of the table storing the content of an element. The table includes a column called parent, which stores a primary key identifier identifying the row representing the parent of an element. To retrieve data specified by an XPATH query, a query that conforms to the Structure Query Language (“SQL”) can be formulated using, for example, a connect-by clause to identify the requested data.

The connect-by clause allows a user to issue SQL queries that request data based on the data's location within an information hierarchy. The data is returned by a relational database system in a way that reflects the hierarchical organization. The connect-by clause is used to specify the condition that defines the hierarchical relationship, which in the current example, is the hierarchical relationship defined by parent and the primary key identifier. The disadvantage of the approach is that it requires many join operations, especially when the query requests data based on a hierarchical location that includes many levels.

Based on the foregoing, it is clearly desirable to devise an approach for organizing and storing XML data, or any form of hierarchical data, that allows portions of an information hierarchy to be accessed more efficiently.

The approaches described in this section are approaches that could be pursued, but not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:

FIG. 1 is a diagram showing an XML document according to an embodiment of the present invention.

FIG. 2 is a diagram showing XML document as an information hierarchy according to an embodiment of the present invention.

FIG. 3 is a diagram showing a relational table used to store an XML document according to an embodiment of the present invention.

FIG. 4 is a grid diagram showing examples of pattern-matching literals that may be used to find matching path signatures of set of nodes requested by a hierarchical query.

FIG. 5 is a diagram showing a relational table and index used to store an XML document according to an embodiment of the present invention.

FIG. 6 is a flowchart depicting a process for finding rows holding data for nodes requested by a XPATH query.

FIG. 7 is a diagram showing pseudo-code for generating hash path signatures according to an embodiment of the present invention.

FIG. 8 is a computer system that may be used to implement an embodiment of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

A method and apparatus for efficiently storing and accessing an information hierarchy is described. In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.

Described herein are techniques for efficiently storing and accessing information hierarchies stored in a relational or object-relational database system. A path signature, which can be similar to a pathname, is stored in a database system in association with data for the node identified by the pathname. For example, a path signature identifying an element is stored in a row that holds data for the element. To retrieve data for a hierarchical query that identifies the data requested using, for example, an XPATH string, a string pattern is generated that is matched by path signatures identified by the XPATH string. Pattern matching is then used to select rows associated with matching path signatures, and data from the selected rows is used to compute the XPATH query. Furthermore, hash values representing path signatures are generated in a way that preserves the ordering of data in an information hierarchy. The hash values can be stored in lieu of the path signatures and indexed to provide quick access to an information hierarchy.

Nodes in an Information Hierarchy

FIG. 2 is a hierarchical diagram 201 depicting XML document 101 as an information hierarchy, provided herein to facilitate an understanding of embodiments of the invention. Hierarchical diagram 201 depicts nodes that correspond to elements or element attributes of XML document 101. Specifically, nodes A, B, C, and D correspond to elements A, B, C, and D in XML document 101. Nodes A.id and A.x correspond to attributes id and x of element A; nodes B.id and B.x correspond to attributes id and x of element B; nodes C.id and C correspond to attributes id and y of element C; nodes D.id and D.x correspond to attributes id and x of element D.

An information hierarchy can have different types of data items. For example, XML document 101 contains elements and element attributes. For convenience of expression, it is convenient to refer to a data item of any particular type in an information hierarchy as a node. For example, the statement “nodes B, A.id, and C are descendants of A” is a convenient way of stating that “elements B and C and element attribute A.id are descendants of A”. The expression “all the nodes of A” is a convenient way of expressing “all the elements and element attributes of A.”

The edge between node A and C represents the parent-child relationship between node A and C, respectively (i.e. element A and C, respectively). The edge between node C and D represents the parent-child relationship between node C and D. The edge between node D and node D.id represents the parent-child relationship between node D and node D.id; the edge between node D and node D.x represents the parent-child relationship between node D and node D.x.

In an information hierarchy, the nodes have a name, content and/or value. Node D has the value “More text”, while node D.id has the value “300”.

Nodes at the same level of an information hierarchy are referred to as sibling nodes. For example, node B and node C are siblings. Node D is a descendant of node C but not a sibling of node B.

Illustrative Relational Storage Mechanism for Storing an XML Document

FIG. 3 is a block diagram of a relational table NT 301, which stores nodes of a XML document 101, according to an embodiment of the present invention. Referring to FIG. 3, table NT 301 includes column path signature 302, node name 304, and value 306. Rows 311-319 in table NT 301 each store data for a node within XML document 101. For a particular row in table NT 301, column path signature 302 contains a “path signature” of the node corresponding to the row, node name 304 includes the name of the node, and value 306 contains the value of the node. A path signature is data that identifies the path or location of a node within an information hierarchy. The path signatures in path signature 302 are strings that conform to XPATH.

For example, row 311 stores data for node A.id (corresponding to the attribute id of element A). For row 311, path signature 302 contains the string value ‘A/I@id/’, node name 304 contains ‘id’, and value 306 contains 0. For row 314, path signature 302 contains the value ‘/A/B’, node name 304 contains ‘B’, and value 306 contains ‘This is text’.

The term shredding refers to the process of dividing an XML document into the parts that are stored in a logical unit of storage, such as a row in a table or an object in an object table. The shredding approach used for shredding XML document 101 in table NT 301 is to store one node in one row. However, an embodiment of the present invention is not so limited. Multiple nodes may be stored in a row, object, or other type of logical unit of storage. The nodes stored in a particular row may form a subtree. For example, a row may contain data about an element and all attributes of the element. The information about the attributes could be stored in, for example, a blob column of the row. A column holding the path signature for a row can identify only the parent or can identify the parent and all of its attributes (XPATH defines approaches for identifying groups of nodes).

In addition, multiple tables or data structures may be used to store a shredded XML document. For example, some data for a node may be stored in another table separate from a table or index that stores a path signature for the node. The other table contains records or entries that associate a path signature with a row storing the data for a node. Furthermore, data representing the content of a node may be stored in more than one table. For example, a node may have a node value in the form of large string and/or have a large number of attributes. The name and path signature of a node are stored in one table, while the node value and attributes are stored in other data structures.

Using Pattern Matching

As mentioned before, an XPATH query includes an XPATH string that identifies a set of nodes in an XML document. According to an embodiment of the present invention, patterning matching is used to find rows in table NT 301 that hold data for nodes identified by an XPATH string. Specifically, data representing a string pattern is generated from an XPATH query and used to find rows storing path signatures that match the string pattern. The data from the rows with matching path signatures is used to generate the results of the XPATH query.

One common way to define a string pattern is to use a string (referred to herein as a “pattern-matching literal”) that specifies in sequence specific characters to be matched and special pattern-matching characters to be matched. For example, the pattern-matching literal ‘R %’ begins with the specific character ‘R’ followed by the special pattern-matching character ‘%’. The pattern-matching literal specifies in sequence the pattern of a matching string. The specific character ‘R’ is only matched by ‘R’. The character ‘%’ is matched by a string of any length (including length 0). Thus, the pattern specified by pattern-matching literal ‘R %’ is any string that begins with R.

FIG. 4 shows exemplary XPATH queries and pattern-matching literals, which are used, in conjunction with table NT 301, to illustrate an embodiment of the present invention. Referring to FIG. 4, it shows grid 401. Each entry in grid 401 shows an XPATH string and pattern-matching literal that is used to select rows in table NT 301 that have a path signature that matches the string pattern.

Entry 402 shows that, for XPATH query ‘/A/C/’, the pattern-matching literal ‘/A/C/%’ may be used to find the path signatures of the nodes identified by the query. The XPATH query ‘/A/C/’ identifies the subtree rooted at node C. The subtree would include node C and its attributes, C.id and C.y, and node D and its attributes, D.id and D.x. The rows in table NT 301 whose path signature match the pattern-matching literal ‘/A/D/%’ are rows 315-319. These rows are retrieved by the following query:

-   -   select * from NT where path signature like ‘/A/D/%.

The above query conforms to SQL. The like operator is the pattern matching operator, which returns true if the left operand matches the pattern defined by the right operand.

Entry 404 shows that for XPATH query ‘/A//D/’, the pattern-matching literal ‘/A/%/D/%’ may be used to find the path signatures of nodes identified by the XPATH query ‘/A/D/’. The XPATH query ‘A//D/’ identifies all the descendants of node A with the name D. The descendants include node D and its attributes, D.id and D.x. The rows in table NT 301 that have matching path signatures are rows 317, 318, and 319.

The approaches for defining string patterns used here are illustrative but not limiting. There are many approaches that may be used for defining string patterns and determining which strings match the patterns; the present invention is not limited to any particular approach.

The Oracle 9i SQL Reference, release 2 (9.2), part Number A96540-01 describes further details about the Like operator and pattern matching, and is herein incorporated by reference. Patterning matching techniques are described in Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms, MIT Press, 1992, incorporated herein by reference.

Ordered Hash Values as Path Signature

Storing path signatures as strings that represent pathnames results in duplicate storage of pathname prefixes. For example, the prefix ‘/A/C’ is stored for all nodes of node C in table NT 301. If a pathname is long, as is the case for many XML documents, a relatively large amount of storage space is used to store duplicate information in the form of prefix strings. To reduce the amount of storage space needed to store a path signature, hash values are generated and used and stored as path signatures. Such hash values are referred to herein as hash path signatures. Hash path signatures represent a particular path or pathname. In general, the hash path signatures are much smaller (in terms of storage space needed to store them) than the pathnames they represent.

In addition, the hash path signatures are generated so that their order corresponds to the order of the pathnames. For example, the hash value generated for ‘/A/B’ is less than that generated for ‘A/B/A’ or ‘/B/A’ but greater than that generated ‘/A’ or ‘/A/A’.

A result of generating hash path signatures in this way is that hash path signatures of all the descendants of a node occupy exclusively a range of hash path signatures. An index that has as key values hash path signatures has entries that are ordered by hash path signatures. The index entries for the descendants are therefore found in a consecutive set of entries. Index scans to find all the descendants of a node can thus be performed very efficiently by scanning only a range of consecutive entries for the descendants. XPATH queries frequently request nodes that share a prefix in their pathnames, or in other words, are descendents of a given root node. Thus, the descendants can be quickly identified by scanning only a range of entries within an index. Furthermore, the test to determine whether a row holds a node requested by a query is performed by determining whether a hash value falls within a range, an operation which can be performed more quickly than making a determination of whether a string matches a string pattern.

FIG. 5 is a block diagram that depicts a hash path signature based storage mechanism for XML document 101. Referring to FIG. 5, it shows relational table NT 501. Table NT 501 includes columns hash path signature 502, node name 504, and value 306. Rows 511-519 in table NT 501 each store data for a node within XML document 101. Similar to table NT 301, for a particular row, node name 504 stores the name of the node whose data is stored in the row, and value 506 contains the value of the node.

Column hash path signature 502 contains, for a particular row in table NT 501, a hash path signature of the node corresponding to the row. For example, in row 511, hash path signature 502 contains the hash value ‘15000012’, the hash path signature for ‘/A/@id/’. For row 514, hash path signature 502 contains the value 15160000, the hash path signature for ‘A/B’.

Index 530 indexes table NT 501 using hash path signature 502 as a key column. A key column is a column that contains key values of an index. Thus, entries within index 520 are ordered by hash path signature values within hash path signature 502. Each of entries 531-539 in index 530 associates a hash path signature to the row that stores data for a node in table NT 501. For example, entry 531 contains the hash path signature ‘15000012’ and row-id 511, a row-id referring to row 511, thereby mapping the hash path signature ‘15000012’ to row 511. A row-id identifies a row. For purposes of exposition, reference numerals used in FIG. 5 to refer to rows 510-519 are used as row-ids within entries 531-539.

FIG. 6 shows a flow chart of a process for finding rows that hold data requested by a XPATH query. The process is illustrated using table NT 501 and index 530.

Referring to FIG. 2, at step 602 an XPATH query is received, the XPATH query requesting a set of nodes. For example, an XPATH query is received that requests the nodes within XML document 101 identified by the XPATH string ‘/A/B’—the nodes of the subtree rooted at node B.

At step 604, a range of hash path signature values is generated based on the XPATH query received at step 602. This entails calculating the boundaries of the range into which the requested nodes must fall. In the current example, the beginning boundary is 15160000, inclusively and 15170000, exclusively. The node with the pathname ‘A/B’ and any descendants of the node must fall within this range.

At step 606, the entries within the range are scanned, beginning with entry 532 and ending with entry 534. The row-ids are retrieved from these entries and used to access table NT 501 to retrieve data needed to compute the received query.

Furthermore, the query may contain other criteria, such as requiring an element to have a particular value for an attribute. The data for the rows in table NT 501, once retrieved, may be further evaluated to determine whether the data has been requested by the query, and further processed to present or structure the data as needed to return the data to the issuer of the query.

Alternate Emdodiments

An embodiment of the present invention has been illustrated using hierarchical queries that are XPATH queries. However, the present invention is not limited to a particular type of hierarchical query. For example, a query may be in the form of a statement that conforms to a database language similar to SQL. Such a statement may contain a “hierarchical operator” that specifies requested data by specifying the data's location within an information hierarchy. Hierarchical operators are described in U.S. application Ser. No. 10/260,138, entitled Operators for Accessing Hierarchical Data in a Relational System, filed on Sep. 9, 2002 by Nipun Agarwal, et al., the contents of which are incorporated herein by reference.

Neither is an embodiment of the present invention limited to a body of data that conforms to XML. An embodiment of the present invention may be used to efficiently store and access data from many types of information hierarchies, such as, for example, a file system. A typical file system has directories arranged in a hierarchy, and files or documents stored in the directories. A pathname for a document is composed of one or more directory and/or a file names. Path signature and hash path signatures can be generated from such names in a pathname.

Generating Hash Path Signatures

As mentioned before, hash path signatures are generated in a way that preserves the order of a node within a hierarchy based on the pathname of the node. FIG. 7 shows the psuedo-code of a procedure used to generate such hash values. The procedure is based on the standards and approaches for generating hash values prescribed by Digest Values for DOM (DOMASH), by H. Maruyama, K. Tamura, N. Uramoto, IBM (April 2000, RFC 2803), the contents of which are incorporated by reference.

Referring to FIG. 7, the procedure generate hashvalue generates a hash value for a node. The procedure generates a hash value by invoking the function DOMHASH, which returns a hash value. This hash value is concatenated to the hash value of the parent, if any.

Procedure DOMHASH generates a hash value based on the node's type, which may be Comment, Processing Instruction, Attribute, or Element, by applying the procedure for calculating digest values (i.e., apply digestCalculation) described in Digest Values for DOM (DOMASH). The function invocation label (node X) returns the name of a given node. The invocation digestCalculation (@+label (node X)) applies the procedure for calculating digest values to the concatenation of the character ‘@’ to the name of a given node X. The procedure digestCalculation can use the MD5 or SHA-1 algorithms, which are well known methods for generating hash values or digital signatures.

Making Changes to Tables When Stored XML Documents Change

A subtree within an XML document may be added or removed, necessitating a change to a table that stores the XML document. Each node stored in the table is associated with range of path signatures in the nodes subtree. The addition or removal of a subtree may require range associated the subtree's parent may be updated to reflect the addition or removal of the subtree.

When modifying a subtree within a table, the rows that store the subtree should be exclusively locked before modifying the rows. This may be accomplished by using a “Select-for-Update” command, as defined by SQL, to modify the rows.

Hardware Overview

FIG. 8 is a block diagram that illustrates a computer system 800 upon which an embodiment of the invention may be implemented. Computer system 800 includes a bus 802 or other communication mechanism for communicating information, and a processor 804 coupled with bus 802 for processing information. Computer system 800 also includes a main memory 806, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 802 for storing information and instructions to be executed by processor 804. Main memory 806 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 804. Computer system 800 further includes a read only memory (ROM) 80 or other static storage device coupled to bus 802 for storing static information and instructions for processor 804. A storage device 810, such as a magnetic disk or optical disk, is provided and coupled to bus 802 for storing information and instructions.

Computer system 800 may be coupled via bus 802 to a display 812, such as a cathode ray tube (CRT), for displaying information to a computer user. An input device 814, including alphanumeric and other keys, is coupled to bus 802 for communicating information and command selections to processor 804. Another type of user input device is cursor control 816, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 804 and for controlling cursor movement on display 812. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane.

The invention is related to the use of computer system 800 for implementing the techniques described herein. According to one embodiment of the invention, those techniques are performed by computer system 800 in response to processor 804 executing one or more sequences of one or more instructions contained in main memory 806. Such instructions may be read into main memory 806 from another computer-readable medium, such as storage device 810. Execution of the sequences of instructions contained in main memory 806 causes processor 804 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.

The term “computer-readable medium” as used herein refers to any medium that participates in providing instructions to processor 804 for execution. Such a medium may take many forms, including but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 810. Volatile media includes dynamic memory, such as main memory 806. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 802. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.

Common forms of computer-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punchcards, papertape, any other physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read.

Various forms of computer readable media may be involved in carrying one or more sequences of one or more instructions to processor 804 for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 800 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 802. Bus 802 carries the data to main memory 806, from which processor 804 retrieves and executes the instructions. The instructions received by main memory 806 may optionally be stored on storage device 810 either before or after execution by processor 804.

Computer system 800 also includes a communication interface 81 coupled to bus 802. Communication interface 81 provides a two-way data communication coupling to a network link 820 that is connected to a local network 822. For example, communication interface 81 may be an integrated services digital network (ISDN) card or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 81 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links may also be implemented. In any such implementation, communication interface 81 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.

Network link 820 typically provides data communication through one or more networks to other data devices. For example, network link 820 may provide a connection through local network 822 to a host computer 824 or to data equipment operated by an Internet Service Provider (ISP) 826. ISP 826 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 82. Local network 822 and Internet 82 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 820 and through communication interface 81, which carry the digital data to and from computer system 800, are exemplary forms of carrier waves transporting the information.

Computer system 800 can send messages and receive data, including program code, through the network(s), network link 820 and communication interface 81. In the Internet example, a server 830 might transmit a requested code for an application program through Internet 82, ISP 826, local network 822 and communication interface 81.

The received code may be executed by processor 804 as it is received, and/or stored in storage device 810, or other non-volatile storage for later execution. In this manner, computer system 800 may obtain application code in the form of a carrier wave.

In the foregoing specification, embodiments of the invention have been described with reference to numerous specific details that may vary from implementation to implementation. Thus, the sole and exclusive indicator of what is the invention, and is intended by the applicants to be the invention, is the set of claims that issue from this application, in the specific form in which such claims issue, including any subsequent correction. Any definitions expressly set forth herein for terms contained in such claims shall govern the meaning of such terms as used in the claims. Hence, no limitation, element, property, feature, advantage or attribute that is not expressly recited in a claim should limit the scope of such claim in any way. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. 

1. A method for providing access to data for nodes of an information hierarchy, wherein said data for said nodes are stored in a plurality of rows of a table, the method comprising the steps of: generating a plurality of hash values that reflects an order of a plurality of pathnames associated with said nodes; wherein each pathname of said plurality of pathnames corresponds to a row of said plurality of rows and identifies a location within the information hierarchy of a node whose data is stored in the row; and storing said plurality of hash values in a data structure that associates said plurality of hash values with said plurality of rows.
 2. The method of claim 1, wherein said data structure is an index having said plurality of hash values as key values.
 3. The method of claim 2, further comprising: calculating a range of hash values based on a set of nodes requested by a query; scanning the index based on the range to find entries corresponding to the range; and retrieving data from the rows corresponding to the entries.
 4. The method of claim 2, wherein said plurality of hash values are stored in a column of said table.
 5. The method of claim 1, wherein said data for nodes of said information hierarchy includes data that conforms to XML.
 6. The method of claim 1, wherein said plurality of hash values are generated by a hash value function that conforms to DOMHASH.
 7. The method of claim 1, wherein: said information hierarchy includes a first node and a second node that is a sibling of said first node, wherein said first node has descendant nodes; the first node is first in said order relative to the second node; and the step of generating a plurality of hash values guarantees that the plurality of hash values associated with descendant nodes is less than a hash value associated with said second node.
 8. The method of claim 7, wherein: said information hierarchy includes a third node that is a sibling of said first node; the third node is first in said order relative to said first node; and the step of generating a plurality of hash values guarantees that the plurality of hash values associated with both said first node and said descendant nodes are greater than a hash value generated for said third node or all descendants of said third node.
 9. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim
 1. 10. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim
 2. 11. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim
 3. 12. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim
 4. 13. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim
 5. 14. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim
 6. 15. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim
 7. 16. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim
 8. 17. A computer-readable medium, comprising: a table with a plurality of rows, each row of said plurality of rows storing data for a node of a plurality of nodes in an information hierarchy; an index of said table having a plurality of hash values as key values within said index, wherein each hash value of said plurality of hash values corresponds to a pathname associated with a node of said plurality of nodes; wherein the pathnames associated with the plurality of the nodes have an order; and wherein said plurality of hash values reflects said order.
 18. The computer-readable medium of claim 17, wherein: said information hierarchy includes a first node and a second node that is a sibling of said first node, wherein said first node has descendant nodes; the first node is first in said order relative to the second node; and each hash value of said plurality of hash values that is associated with the descendant nodes is less than the hash value associated with said second node.
 19. The computer-readable medium of claim 18, wherein: said information hierarchy includes a third node that is a sibling of said first node; the third node is first in said order relative to said first node; and each hash value of said plurality of hash values that is associated with both said first node and said descendant nodes is greater than a hash value generated for said third node or all descendants of said third node. 